71 research outputs found
The First Order Definability of Graphs with Separators via the Ehrenfeucht Game
We say that a first order formula defines a graph if is
true on and false on every graph non-isomorphic with . Let
be the minimal quantifier rank of a such formula. We prove that, if is a
tree of bounded degree or a Hamiltonian (equivalently, 2-connected) outerplanar
graph, then , where denotes the order of . This bound is
optimal up to a constant factor. If is a constant, for connected graphs
with no minor and degree , we prove the bound
. This result applies to planar graphs and, more generally, to
graphs of bounded genus.Comment: 17 page
On the Obfuscation Complexity of Planar Graphs
Being motivated by John Tantalo's Planarity Game, we consider straight line
plane drawings of a planar graph with edge crossings and wonder how
obfuscated such drawings can be. We define , the obfuscation complexity
of , to be the maximum number of edge crossings in a drawing of .
Relating to the distribution of vertex degrees in , we show an
efficient way of constructing a drawing of with at least edge
crossings. We prove bounds (\delta(G)^2/24-o(1))n^2 < \obf G <3 n^2 for an
-vertex planar graph with minimum vertex degree .
The shift complexity of , denoted by , is the minimum number of
vertex shifts sufficient to eliminate all edge crossings in an arbitrarily
obfuscated drawing of (after shifting a vertex, all incident edges are
supposed to be redrawn correspondingly). If , then
is linear in the number of vertices due to the known fact that the matching
number of is linear. However, in the case we notice that
can be linear even if the matching number is bounded. As for
computational complexity, we show that, given a drawing of a planar graph,
it is NP-hard to find an optimum sequence of shifts making crossing-free.Comment: 12 pages, 1 figure. The proof of Theorem 3 is simplified. An overview
of a related work is adde
- …